The Approximate Bilinear Algorithm of Length 46 for Multiplication of 4 x 4 Matrices
نویسنده
چکیده
We propose the arbitrary precision approximate (APA) bilinear algorithm of length 46 for multiplication of 4 x 4 and 4 x 4 matrices. The algorithm has polynomial order 3 and 352 nonzero coefficients from total 2208.
منابع مشابه
The Border Rank of the Multiplication of 2× 2 Matrices Is Seven
One of the leading problems of algebraic complexity theory is matrix multiplication. The näıve multiplication of two n× n matrices uses n multiplications. In 1969 Strassen [19] presented an explicit algorithm for multiplying 2 × 2 matrices using seven multiplications. In the opposite direction, Hopcroft and Kerr [11] and Winograd [20] proved independently that there is no algorithm for multiply...
متن کاملFast Structured Matrix Computations: Tensor Rank and Cohn-Umans Method
We discuss a generalization of the Cohn–Umans method, a potent technique developed for studying the bilinear complexity of matrix multiplication by embedding matrices into an appropriate group algebra. We investigate how the Cohn–Umans method may be used for bilinear operations other than matrix multiplication, with algebras other than group algebras, and we relate it to Strassen’s tensor rank ...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملNew Practical Strassen-like Approximate Matrix-multiplication Algorithms Found via Solving a System of Cubic Equations
We have encapsulated the concept of matrix multiplication into a system of cubic equations. We discuss the properties of this system and the symmetry group of the set of solutions. Using solutions of these equations, we propose new algorithms for matrix multiplication, with explicit inequalities that bound the error. Also we calculate exactly the “hidden coefficient” in the Big-Oh notation for ...
متن کاملA bilinear algorithm for sparse representations
We consider the following sparse representation problem: represent a given matrix X ∈ IRm×N as a multiplication X = AS of two matrices A ∈ IRm×n (m 6 n < N) and S ∈ IRn×N , under requirements that all m×m submatrices of A are nonsingular, and S is sparse in sense that each column of S has at least n −m + 1 zero elements. It is known that under some mild additional assumptions, such representati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1412.1687 شماره
صفحات -
تاریخ انتشار 2014